Interval eigenproblem in max–min algebra

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monotone interval eigenproblem in max-min algebra

Institute of Mathematics of the Academy of Sciences of the Czech Republic provides access to digitized documents strictly for personal use. Each copy of any part of this document must contain these Terms of use. This paper has been digitized, optimized for electronic delivery and stamped with digital signature within the project DML-CZ: The Czech Digital Mathematics Library The interval eigenpr...

متن کامل

The Computing Procedure for the Multiparametric Eigenproblem in Max Algebra

Denote a⊕ b = max(a,b), and a⊗ b = a+ b, for a,b ∈ R and extend this pair of operations to matrices and vectors in the same way as in conventional linear algebra, that is if A = (ai j),B = (bi j),C = (ci j) are real matrices or vectors of compatible sizes then C = A⊗ B if ci j = ⊕ k aik ⊗ bk j for all i, j. For any n× n matrix A = (ai j) and for arbitrary sequence of real parameters α = (α1, . ...

متن کامل

Simple Interval Algebra

This paper addresses the problem of eeciently updating a network of temporal constraints when constraints are removed from an existing network, or when they are added to it. Such processing tasks are important in many AI-applications requiring a temporal reasoning module. First we analyze the relationship between shortest-paths algorithms for directed graphs and arc-consistency techniques. Then...

متن کامل

Spectrum of Two-sided Eigenproblem in Max Algebra: Every System of Intervals Is Realizable

We consider the two-sided eigenproblem A⊗ x = λ⊗ B ⊗ x over max algebra. It is shown that any finite system of real intervals and points can be represented as spectrum of this eigenproblem.

متن کامل

Global consistency in interval algebra networks : tractable

Global consistency is an important property in binary constraint satisfaction problems. It implies minimality in the sense that the edges contain all and only the labels that can participate in a global solution, which, for instance, is an important property in querying temporal knowledge bases. Another, computational, advantage of a globally consistent network is that nding a solution can be d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2014

ISSN: 0024-3795

DOI: 10.1016/j.laa.2013.10.034